Wiener indices of balanced binary treesBEREG, Sergey; HAO WANG.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-26032-3, 3Vol, part II, 851-859Conference Paper

Un efamille d'opérations sur les arbres binaires = A family of operations on binary treesBLONDEL, V.Comptes rendus de l'Académie des sciences. Série 1, Mathématique. 1995, Vol 321, Num 4, pp 491-494, issn 0764-4442Article

KP line solitons and Tamari latticesDIMAKIS, Aristophanes; MÜLLER-HOISSEN, Folkert.Journal of physics. A, Mathematical and theoretical (Print). 2011, Vol 44, Num 2, issn 1751-8113, 025203.1-025203.49Article

On the shrinkage exponent for read-once formulaeHASTAD, J; RAZBOROV, A; YAO, A et al.Theoretical computer science. 1995, Vol 141, Num 1-2, pp 269-282, issn 0304-3975Article

Order-preserving, upward drawing of binary trees using fewer bendsSUNG KWON KIM.Discrete applied mathematics. 2004, Vol 143, Num 1-3, pp 318-323, issn 0166-218X, 6 p.Article

Distortion of the Poisson Bracket by the Noncommutative Planck ConstantsRUUGE, Artur E; VAN OYSTAEYEN, Freddy.Communications in mathematical physics. 2011, Vol 304, Num 2, pp 369-393, issn 0010-3616, 25 p.Article

Finite trees as ordinalsJERVELL, Herman Ruge.Lecture notes in computer science. 2005, pp 211-220, issn 0302-9743, isbn 3-540-26179-6, 10 p.Conference Paper

Algorithms for drawing binary trees in the planeSHIN, C.-S; SUNG KWON KIM; KIM, S.-H et al.Information processing letters. 1998, Vol 66, Num 3, pp 133-139, issn 0020-0190Article

Grammar-oriented enumeration of binary treesXIANG, L; TANG, C; USHIJIMA, K et al.Computer journal (Print). 1997, Vol 40, Num 5, pp 278-291, issn 0010-4620Article

Irredundant tests for binary tablesMADATYAN, Kh. A.Computational mathematics and mathematical physics. 1997, Vol 37, Num 2, pp 240-246, issn 0965-5425Article

On the average number of registers needed to evaluate a special class of backtrack treesTRIER, U.Informatique théorique et applications (Imprimé). 1993, Vol 27, Num 6, pp 541-554, issn 0988-3754Article

Animaux et arbres guingoisBETREMA, J; PENAUD, J. G.Theoretical computer science. 1993, Vol 117, Num 1-2, pp 67-89, issn 0304-3975Conference Paper

Binary tree encryption: Constructions and applicationsKATZ, Jonathan.Lecture notes in computer science. 2004, pp 1-11, issn 0302-9743, isbn 3-540-21376-7, 11 p.Conference Paper

On efficient entreeingsAMERINS, P. S; BAEZA-YATES, R. A; WOOD, D et al.Acta informatica. 1993, Vol 30, Num 3, pp 203-213, issn 0001-5903Article

A simple bijection between a subclass of 2-binary trees and ternary treesPRODINGER, Helmut.Discrete mathematics. 2009, Vol 309, Num 4, pp 959-961, issn 0012-365X, 3 p.Article

Computing the quartet distance between trees of arbitrary degreeCHRISTIANSEN, Chris; MAILUND, Thomas; PEDERSEN, Christian N. S et al.Lecture notes in computer science. 2005, pp 77-88, issn 0302-9743, isbn 3-540-29008-7, 1Vol, 12 p.Conference Paper

Binary trees and uniform distribution of traffic cutbackLI, S.-Y. R.Journal of computer and system sciences (Print). 1986, Vol 32, Num 1, pp 1-14, issn 0022-0000Article

A fast algorithm for optimum height-limited alphabetic binary treesLARMORE, L. L; PRZYTYCKA, T. M.SIAM journal on computing (Print). 1994, Vol 23, Num 6, pp 1283-1312, issn 0097-5397Article

Enumeration of binary treesVINNAKOTA BAPIRAJU; BAPESWARA RAO, V. V.Information processing letters. 1994, Vol 51, Num 3, pp 125-127, issn 0020-0190Article

Efficient algorithms for dilated mappings of binary treesMOHAMMAD ASHRAF IQBAL.Journal of parallel and distributed computing (Print). 1992, Vol 15, Num 1, pp 75-78, issn 0743-7315Article

Monte Carlo simulation study of the two-stage percolation transition in enhanced binary treesNOGAWA, Tomoaki; HASEGAWA, Takehisa.Journal of physics. A, Mathematical and theoretical (Print). 2009, Vol 42, Num 14, issn 1751-8113, 145001.1-145001.8Article

Reply to the comment on 'Monte Carlo simulation study of the two-stage percolation transition in enhanced binary trees'NOGAWA, Tomoaki; HASEGAWA, Takehisa.Journal of physics. A, Mathematical and theoretical (Print). 2009, Vol 42, Num 47, issn 1751-8113, 478002.1-478002.4Article

Growing binary trees in a random environmentKESSLER, I; SIDI, M.IEEE transactions on information theory. 1993, Vol 39, Num 1, pp 191-194, issn 0018-9448Article

An algorithm to compute the Möbius function of the rotation lattice of binary treesPALLO, J. M.Informatique théorique et applications (Imprimé). 1993, Vol 27, Num 4, pp 341-348, issn 0988-3754Article

Nondiscriminatory propagation on treesSEVERINI, Simone.Journal of physics. A, Mathematical and theoretical (Print). 2008, Vol 41, Num 48, issn 1751-8113, 482002.1-482002.10Article